<!DOCTYPE html>
<html>
<head><meta name="generator" content="Hexo 3.8.0">
    <!-- so meta -->
    <meta charset="utf-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="HandheldFriendly" content="True">
    <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1">
    <meta name="description" content="测试一下Markdown和Mathjax 传送门虽然说这题有简单的方法，可是这其实是个点分治裸题欸 假设当前的分治到的重心为$x$，很显然，经过$x$的那些合法的链，肯定链中每个数都含有起码一个相同的$a[x]$的质因子，因为$gcd|a[x]$嘛。把$a[x]$分解质因数，然后对每个质因子$p$，都做一次dfs，求出离$x$最远的两个点$u,v$，这两个点到x的路径上的数当然都要被$p$整除，然">
<meta property="og:type" content="article">
<meta property="og:title" content="Test">
<meta property="og:url" content="http://ymzqwq.github.io/2019/03/21/HelloWorld/index.html">
<meta property="og:site_name" content="ymzqwq">
<meta property="og:description" content="测试一下Markdown和Mathjax 传送门虽然说这题有简单的方法，可是这其实是个点分治裸题欸 假设当前的分治到的重心为$x$，很显然，经过$x$的那些合法的链，肯定链中每个数都含有起码一个相同的$a[x]$的质因子，因为$gcd|a[x]$嘛。把$a[x]$分解质因数，然后对每个质因子$p$，都做一次dfs，求出离$x$最远的两个点$u,v$，这两个点到x的路径上的数当然都要被$p$整除，然">
<meta property="og:locale" content="default">
<meta property="og:updated_time" content="2019-04-07T12:40:41.895Z">
<meta name="twitter:card" content="summary">
<meta name="twitter:title" content="Test">
<meta name="twitter:description" content="测试一下Markdown和Mathjax 传送门虽然说这题有简单的方法，可是这其实是个点分治裸题欸 假设当前的分治到的重心为$x$，很显然，经过$x$的那些合法的链，肯定链中每个数都含有起码一个相同的$a[x]$的质因子，因为$gcd|a[x]$嘛。把$a[x]$分解质因数，然后对每个质因子$p$，都做一次dfs，求出离$x$最远的两个点$u,v$，这两个点到x的路径上的数当然都要被$p$整除，然">
    
    
        
          
              <link rel="shortcut icon" href="/images/favicon.ico">
          
        
        
          
            <link rel="icon" type="image/png" href="/images/favicon-192x192.png" sizes="192x192">
          
        
        
          
            <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon.png">
          
        
    
    <!-- title -->
    <title>Test</title>
    <!-- styles -->
    <link rel="stylesheet" href="/css/style.css">
    <!-- rss -->
    
    
      <link rel="alternate" href="/atom.xml" title="ymzqwq" type="application/atom+xml">
    
</head>

<body>
    
      <div id="header-post">
  <a id="menu-icon" href="#"><i class="fa fa-bars fa-lg"></i></a>
  <a id="menu-icon-tablet" href="#"><i class="fa fa-bars fa-lg"></i></a>
  <a id="top-icon-tablet" href="#" onclick="$('html, body').animate({ scrollTop: 0 }, 'fast');" style="display:none;"><i class="fa fa-chevron-up fa-lg"></i></a>
  <span id="menu">
    <span id="nav">
      <ul>
         
          <li><a href="/">Home</a></li>
         
          <li><a href="/About/">About</a></li>
         
          <li><a href="/archives/">Writing</a></li>
         
          <li><a href="http://github.com/sergodeeva">Projects</a></li>
         
          <li><a href="/Search/">Search</a></li>
        
      </ul>
    </span>
    <br>
    <span id="actions">
      <ul>
        
        
        <li><a class="icon" href="/2019/03/21/hello-world/"><i class="fa fa-chevron-right" aria-hidden="true" onmouseover="$('#i-next').toggle();" onmouseout="$('#i-next').toggle();"></i></a></li>
        
        <li><a class="icon" href="#" onclick="$('html, body').animate({ scrollTop: 0 }, 'fast');"><i class="fa fa-chevron-up" aria-hidden="true" onmouseover="$('#i-top').toggle();" onmouseout="$('#i-top').toggle();"></i></a></li>
        <li><a class="icon" href="#"><i class="fa fa-share-alt" aria-hidden="true" onmouseover="$('#i-share').toggle();" onmouseout="$('#i-share').toggle();" onclick="$('#share').toggle();return false;"></i></a></li>
      </ul>
      <span id="i-prev" class="info" style="display:none;">Previous post</span>
      <span id="i-next" class="info" style="display:none;">Next post</span>
      <span id="i-top" class="info" style="display:none;">Back to top</span>
      <span id="i-share" class="info" style="display:none;">Share post</span>
    </span>
    <br>
    <div id="share" style="display: none">
      <ul>
  <li><a class="icon" href="http://www.facebook.com/sharer.php?u=http://ymzqwq.github.io/2019/03/21/HelloWorld/"><i class="fa fa-facebook " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="https://twitter.com/share?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&text=Test"><i class="fa fa-twitter " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://www.linkedin.com/shareArticle?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-linkedin " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="https://pinterest.com/pin/create/bookmarklet/?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&is_video=false&description=Test"><i class="fa fa-pinterest " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="mailto:?subject=Test&body=Check out this article: http://ymzqwq.github.io/2019/03/21/HelloWorld/"><i class="fa fa-envelope " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="https://getpocket.com/save?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-get-pocket " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://reddit.com/submit?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-reddit " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://www.stumbleupon.com/submit?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-stumbleupon " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://digg.com/submit?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-digg " aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://www.tumblr.com/share/link?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&name=Test&description="><i class="fa fa-tumblr " aria-hidden="true"></i></a></li>
</ul>

    </div>
    <div id="toc">
      
    </div>
  </span>
</div>

    
    <div class="content index width mx-auto px2 my4">
        
        <article class="post" itemscope itemtype="http://schema.org/BlogPosting">
  <header>
    
    <h1 class="posttitle" itemprop="name headline">
        Test
    </h1>



    <div class="meta">
      <span class="author" itemprop="author" itemscope itemtype="http://schema.org/Person">
        <span itemprop="name">ymzqwq</span>
      </span>
      
    <div class="postdate">
        <time datetime="2019-03-21T08:33:01.000Z" itemprop="datePublished">2019-03-21</time>
    </div>


      

    </div>
  </header>
  

  <div class="content" itemprop="articleBody">
    <p>测试一下Markdown和Mathjax</p>
<p><a href="https://www.luogu.org/problemnew/show/CF1101D" target="_blank" rel="noopener">传送门</a><br>虽然说这题有简单的方法，可是这其实是个点分治裸题欸</p>
<p>假设当前的分治到的重心为$x$，很显然，经过$x$的那些合法的链，肯定链中每个数都含有起码一个相同的$a[x]$的质因子，因为$gcd|a[x]$嘛。把$a[x]$分解质因数，然后对每个质因子$p$，都做一次dfs，求出离$x$最远的两个点$u,v$，这两个点到x的路径上的数当然都要被$p$整除，然后$ans=max(ans,dis(u)+dis(v))$，$dis(u)$表示$u$到$x$的距离。要注意$u,v$不能在一个子树内。</p>
<p>然后每次找重心，不停把树分割就行了。</p>
<p>点分治码量比较大，但是熟练之后打起来其实还是挺快的。。<del>大多都是板子，比赛的时候复制粘贴23333</del></p>
<figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span><span class="meta-string">&lt;bits/stdc++.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">pragma</span> GCC optimize(<span class="meta-string">"Ofast"</span>)</span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">define</span> ll long long</span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">define</span> fr(i,x,y) for(int i=(x);i&lt;=(y);i++)</span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">define</span> rf(i,x,y) for(int i=(x);i&gt;=(y);i--)</span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">define</span> frl(i,x,y) for(int i=(x);i&lt;(y);i++)</span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">const</span> <span class="keyword">int</span> N=<span class="number">200002</span>;</span><br><span class="line"><span class="keyword">const</span> <span class="keyword">int</span> M=N&lt;&lt;<span class="number">1</span>;</span><br><span class="line"><span class="keyword">int</span> n,a[N];</span><br><span class="line"><span class="keyword">int</span> cnt,head[N],Next[M],v[M];</span><br><span class="line"><span class="keyword">int</span> b[N];</span><br><span class="line"><span class="keyword">int</span> rt,mx,mxx;</span><br><span class="line"><span class="keyword">int</span> sz[N],mmx[N],s[M];</span><br><span class="line"><span class="keyword">int</span> ans=<span class="number">-1</span>;</span><br><span class="line"><span class="built_in">vector</span>&lt;<span class="keyword">int</span>&gt; p[N];</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">read</span><span class="params">(<span class="keyword">int</span> &amp;x)</span></span>&#123;</span><br><span class="line">	<span class="keyword">char</span> ch=getchar();x=<span class="number">0</span>;</span><br><span class="line">	<span class="keyword">for</span>(;ch&lt;<span class="string">'0'</span>||ch&gt;<span class="string">'9'</span>;ch=getchar());</span><br><span class="line">	<span class="keyword">for</span>(;ch&gt;=<span class="string">'0'</span>&amp;&amp;ch&lt;=<span class="string">'9'</span>;ch=getchar()) x=(x&lt;&lt;<span class="number">3</span>)+(x&lt;&lt;<span class="number">1</span>)+ch-<span class="string">'0'</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">add</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> y)</span></span>&#123;</span><br><span class="line">	Next[++cnt]=head[x];</span><br><span class="line">	head[x]=cnt;</span><br><span class="line">	v[cnt]=y;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">findrt</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> fa,<span class="keyword">int</span> n)</span></span>&#123; <span class="comment">//找重心</span></span><br><span class="line">    sz[x]=<span class="number">1</span>;mmx[x]=<span class="number">0</span>;</span><br><span class="line">    <span class="keyword">int</span> ans=<span class="number">0</span>,tt;</span><br><span class="line">    <span class="keyword">for</span>(<span class="keyword">int</span> i=head[x];i;i=Next[i])</span><br><span class="line">     <span class="keyword">if</span> (v[i]!=fa&amp;&amp;!b[v[i]])&#123;</span><br><span class="line">        tt=findrt(v[i],x,n);</span><br><span class="line">        <span class="keyword">if</span> (mmx[tt]&lt;mmx[ans]) ans=tt;</span><br><span class="line">        sz[x]+=sz[v[i]];</span><br><span class="line">        mmx[x]=max(mmx[x],sz[v[i]]);</span><br><span class="line">     &#125;</span><br><span class="line">    mmx[x]=max(mmx[x],n-sz[x]);</span><br><span class="line">    <span class="keyword">if</span> (mmx[x]&lt;mmx[ans]) ans=x;</span><br><span class="line">    <span class="keyword">return</span> ans;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">getdis</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> fa,<span class="keyword">int</span> vv)</span></span>&#123;</span><br><span class="line">	<span class="keyword">int</span> mx=<span class="number">0</span>;</span><br><span class="line">	<span class="keyword">for</span>(<span class="keyword">int</span> i=head[x];i;i=Next[i])</span><br><span class="line">	 <span class="keyword">if</span> (v[i]!=fa&amp;&amp;!b[v[i]]&amp;&amp;a[v[i]]%vv==<span class="number">0</span>)</span><br><span class="line">	  mx=max(mx,getdis(v[i],x,vv));</span><br><span class="line">	<span class="keyword">return</span> mx+<span class="number">1</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">cal</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> vv)</span></span>&#123; <span class="comment">//找最远的两个点</span></span><br><span class="line">	ans=max(ans,<span class="number">0</span>);</span><br><span class="line">	<span class="keyword">int</span> mx=<span class="number">-1</span>,mxx=<span class="number">-1</span>;</span><br><span class="line">	<span class="keyword">for</span>(<span class="keyword">int</span> i=head[x];i;i=Next[i])</span><br><span class="line">	 <span class="keyword">if</span> (!b[v[i]]&amp;&amp;a[v[i]]%vv==<span class="number">0</span>)&#123;</span><br><span class="line">	 	<span class="keyword">int</span> xx=getdis(v[i],x,vv);</span><br><span class="line">	 	<span class="keyword">if</span> (xx&gt;mx) mx=xx;</span><br><span class="line">	 	<span class="keyword">if</span> (mx&gt;mxx) swap(mx,mxx);</span><br><span class="line">	 &#125;</span><br><span class="line">	<span class="keyword">return</span> max(mx+mxx,mxx);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">dfs</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> n)</span></span>&#123; <span class="comment">//分割树</span></span><br><span class="line">	b[x]=<span class="number">1</span>;<span class="keyword">int</span> tmp=a[x];</span><br><span class="line">	frl(i,<span class="number">0</span>,p[tmp].size())</span><br><span class="line">	 ans=max(ans,cal(x,p[tmp][i])); <span class="comment">//对每个质因子都找最远的</span></span><br><span class="line">	<span class="keyword">for</span>(<span class="keyword">int</span> i=head[x];i;i=Next[i])</span><br><span class="line">	 <span class="keyword">if</span> (!b[v[i]])&#123;</span><br><span class="line">	 	<span class="keyword">int</span> rt=findrt(v[i],<span class="number">0</span>,sz[v[i]]);</span><br><span class="line">	 	assert(rt&gt;<span class="number">0</span>);</span><br><span class="line">	 	dfs(rt,s[i]);</span><br><span class="line">	 &#125;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">init</span><span class="params">()</span></span>&#123; <span class="comment">//分解质因数</span></span><br><span class="line">	frl(i,<span class="number">2</span>,N)</span><br><span class="line">	 <span class="keyword">if</span> (!b[i])&#123;</span><br><span class="line">	 	p[i].push_back(i);</span><br><span class="line">	 	<span class="keyword">for</span>(<span class="keyword">int</span> j=<span class="number">2</span>*i;j&lt;N;j+=i)</span><br><span class="line">	 	 p[j].push_back(i),b[j]=<span class="number">1</span>;</span><br><span class="line">	 &#125;</span><br><span class="line">	<span class="built_in">memset</span>(b,<span class="number">0</span>,<span class="keyword">sizeof</span> b);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>&#123;</span><br><span class="line">	init();</span><br><span class="line">	read(n);</span><br><span class="line">	fr(i,<span class="number">1</span>,n) read(a[i]);</span><br><span class="line">	<span class="keyword">int</span> x,y;</span><br><span class="line">	fr(i,<span class="number">2</span>,n)&#123;</span><br><span class="line">		read(x);read(y);</span><br><span class="line">		add(x,y);add(y,x);</span><br><span class="line">	&#125;</span><br><span class="line">	<span class="comment">//int rt=findrt(1,0,n);</span></span><br><span class="line">	mmx[<span class="number">0</span>]=<span class="number">2e9</span>;</span><br><span class="line">	dfs(findrt(<span class="number">1</span>,<span class="number">0</span>,n),n);</span><br><span class="line">	<span class="built_in">cout</span>&lt;&lt;ans+<span class="number">1</span>&lt;&lt;<span class="built_in">endl</span>;</span><br><span class="line">	<span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
  </div>
</article>



    </div>
    
      <div id="footer-post-container">
  <div id="footer-post">

    <div id="nav-footer" style="display: none">
      <ul>
         
          <li><a href="/">Home</a></li>
         
          <li><a href="/About/">About</a></li>
         
          <li><a href="/archives/">Writing</a></li>
         
          <li><a href="http://github.com/sergodeeva">Projects</a></li>
         
          <li><a href="/Search/">Search</a></li>
        
      </ul>
    </div>

    <div id="toc-footer" style="display: none">
      
    </div>

    <div id="share-footer" style="display: none">
      <ul>
  <li><a class="icon" href="http://www.facebook.com/sharer.php?u=http://ymzqwq.github.io/2019/03/21/HelloWorld/"><i class="fa fa-facebook fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="https://twitter.com/share?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&text=Test"><i class="fa fa-twitter fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://www.linkedin.com/shareArticle?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-linkedin fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="https://pinterest.com/pin/create/bookmarklet/?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&is_video=false&description=Test"><i class="fa fa-pinterest fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="mailto:?subject=Test&body=Check out this article: http://ymzqwq.github.io/2019/03/21/HelloWorld/"><i class="fa fa-envelope fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="https://getpocket.com/save?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-get-pocket fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://reddit.com/submit?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-reddit fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://www.stumbleupon.com/submit?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-stumbleupon fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://digg.com/submit?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&title=Test"><i class="fa fa-digg fa-lg" aria-hidden="true"></i></a></li>
  <li><a class="icon" href="http://www.tumblr.com/share/link?url=http://ymzqwq.github.io/2019/03/21/HelloWorld/&name=Test&description="><i class="fa fa-tumblr fa-lg" aria-hidden="true"></i></a></li>
</ul>

    </div>

    <div id="actions-footer">
      <ul>
        <li id="toc"><a class="icon" href="#" onclick="$('#toc-footer').toggle();return false;"><i class="fa fa-list fa-lg" aria-hidden="true"></i> TOC</a></li>
        <li id="share"><a class="icon" href="#" onclick="$('#share-footer').toggle();return false;"><i class="fa fa-share-alt fa-lg" aria-hidden="true"></i> Share</a></li>
        <li id="top" style="display:none"><a class="icon" href="#" onclick="$('html, body').animate({ scrollTop: 0 }, 'fast');"><i class="fa fa-chevron-up fa-lg" aria-hidden="true"></i> Top</a></li>
        <li id="menu"><a class="icon" href="#" onclick="$('#nav-footer').toggle();return false;"><i class="fa fa-bars fa-lg" aria-hidden="true"></i> Menu</a></li>
      </ul>
    </div>

  </div>
</div>

    
    <footer id="footer">
  <div class="footer-left">
    Copyright &copy; 2019 ymzqwq
  </div>
  <div class="footer-right">
    <nav>
      <ul>
         
          <li><a href="/">Home</a></li>
         
          <li><a href="/About/">About</a></li>
         
          <li><a href="/archives/">Writing</a></li>
         
          <li><a href="http://github.com/sergodeeva">Projects</a></li>
         
          <li><a href="/Search/">Search</a></li>
        
      </ul>
    </nav>
  </div>
</footer>

<script type="text/x-mathjax-config">
    MathJax.Hub.Config({
        tex2jax: {
            inlineMath: [ ["$","$"], ["\\(","\\)"] ],
            skipTags: ['script', 'noscript', 'style', 'textarea', 'pre', 'code'],
            processEscapes: true
        }
    });
    MathJax.Hub.Queue(function() {
        var all = MathJax.Hub.getAllJax();
        for (var i = 0; i < all.length; ++i)
            all[i].SourceElement().parentNode.className += ' has-jax';
    });
</script>
<script src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
<script src="/live2dw/lib/L2Dwidget.min.js?0c58a1486de42ac6cc1c59c7d98ae887"></script><script>L2Dwidget.init({"log":false,"pluginJsPath":"lib/","pluginModelPath":"assets/","pluginRootPath":"live2dw/","tagMode":false});</script></body>
</html>
<!-- styles -->
<link rel="stylesheet" href="/lib/font-awesome/css/font-awesome.min.css">
<link rel="stylesheet" href="/lib/meslo-LG/styles.css">
<link rel="stylesheet" href="/lib/justified-gallery/justifiedGallery.min.css">

<!-- jquery -->
<script src="/lib/jquery/jquery.min.js"></script>
<script src="/lib/justified-gallery/jquery.justifiedGallery.min.js"></script>
<script src="/js/main.js"></script>


    <!-- Google Analytics -->
    <script type="text/javascript">
        (function(i,s,o,g,r,a,m) {i['GoogleAnalyticsObject']=r;i[r]=i[r]||function() {
        (i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
        m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
        })(window,document,'script','//www.google-analytics.com/analytics.js','ga');
        ga('create', 'UA-37473492-6', 'auto');
        ga('send', 'pageview');
    </script>



